Dynamic Preemptive Multi-class Routing Scheme Under Dynamic Traffic in Survivable WDM Mesh Networks

A large-scale optical network will carry various traffic classes with different fault-tolerance requirements. Several previous papers suggest a preemptive multi-class routing scheme. They have proposed Integer Linear Programming (ILP) formulations to implement this routing scheme and simulate it under the assumption that the traffic holding on the network will not depart. However, in the real world, most of the traffic is the dynamic traffic: the traffic holding on the network will leave at the end of connection holding time. In this paper, we propose a detailed algorithm for Dynamic Preemptive Multi-class Routing (DPMR) scheme under dynamic traffic pattern. Furthermore, we compare DPMR scheme with DPP (Dedicated Path Protection) and SPP (Shared Path Protection), and evaluate their performances from resource utilization ratio and blocking probability. In addition, we propose a modified link cost function for Dynamic Preemptive Multi-class Routing scheme to find the routes.